Adding Edges for Maximizing Weighted Reachability
نویسندگان
چکیده
منابع مشابه
Adding Edges for a Simple Cycle to a Complete Binary Tree Maximizing Total Shortening Path Length
Abstract—This study proposes a model of adding edges of forming a simple cycle to a level of depth N in a complete binary tree of height H under giving priority to edges between two nodes of which the deepest common ancestor is deeper. An optimal depth N* is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all...
متن کاملAdding Edges for a Simple Path to a Level of a Complete Binary Tree Maximizing Total Shortening Path Length
This study proposes a model of adding edges of forming a simple path to a level of depth N in a complete binary tree of height H under giving priority to edges between two nodes of which the deepest common ancestor is deeper. An optimal depth N∗ is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes in ...
متن کاملOptimal Reachability for Weighted Timed Games
Weighted timed automata are timed automata annotated with costs on locations and transitions. The optimal game-reachability problem for these automata is to find the best-cost strategy of supplying the inputs so as to ensure reachability of a target set within a specified number of iterations. The only known complexity bound for this problem is a doubly-exponential upper bound. We establish a s...
متن کاملVisualizing Weighted Edges in Graphs
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2020
ISSN: 1999-4893
DOI: 10.3390/a13030068